Towards Automatic Band-Limited Procedural Shaders
نویسندگان
چکیده
Procedural shaders are a vital part of modern rendering systems. Despite their prevalence, however, procedural shaders remain sensitive to aliasing any time they are sampled at a rate below the Nyquist limit. Antialiasing is typically achieved through numerical techniques like supersampling or precomputing integrals stored in mipmaps. This paper explores the problem of analytically computing a band-limited version of a procedural shader as a continuous function of the sampling rate. There is currently no known way of analytically computing these integrals in general. We explore the conditions under which exact solutions are possible and develop several approximation strategies for when they are not. Compared to supersampling methods, our approach produces shaders that are less expensive to evaluate and closer to ground truth in many cases. Compared to mipmapping or precomputation, our approach produces shaders that support an arbitrary bandwidth parameter and require less storage. We evaluate our method on a range of spatially-varying shader functions, automatically producing antialiased versions that have comparable error to 4x4 multisampling but can be over an order of magnitude faster. While not complete, our approach is a promising first step toward this challenging goal and indicates a number of interesting directions for future work.
منابع مشابه
Real-time Shading: Sampling Procedural Shaders
In interactive or real-time applications, naturally the complexity of tasks that can be performed on the fly is limited. For that reason it is likely that even with the current rate of development in graphics hardware, the more complex shaders will not be feasible in this kind of application for some time to come. One solution to this problem seems to be a precomputation approach, where the pro...
متن کاملSymbolic Differentiation in GPU Shaders
Derivatives arise frequently in graphics and GPGPU applications. 1 To meet this need we have added symbolic differentiation as a built 2 in language feature in the HLSL shading language. The symbolic 3 derivative is computed at compile time so it is available in all types 4 of shaders (geometry, pixel, vertex, etc.). The algorithm for com5 puting the symbolic derivative is simple and has reason...
متن کاملProcedural Texture Matching and Transformation
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation uses a library of procedural shaders and selects the correct shaders and associated parameters to accomplish the task. In general, selecting a procedural texture from a library, or finding the correct parameters to produ...
متن کاملSampling of Procedural Shaders Using Affine Arithmetic
Procedural shaders have become popular tools for describing surface reflectance functions and other material properties. In comparison to fixed resolution textures they have the advantage of being resolution independent and storage efficient. While procedural shaders provide an interface for evaluating the shader at a single point in parameter space, it is not easily possible to obtain an avera...
متن کاملSampling of Procedural Shaders Using A ne Arithmetic
Procedural shaders have become popular tools for describing surface reeectance functions and other material properties. In comparison to xed resolution textures they have the advantage of being resolution independent and storage eecient. While procedural shaders provide an interface for evaluating the shader at a single point in parameter space, it is not easily possible to obtain an average va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 34 شماره
صفحات -
تاریخ انتشار 2015